On Parity Vectors of Latin Squares

نویسندگان

  • Diane Donovan
  • Mike J. Grannell
  • Terry S. Griggs
  • James G. Lefevre
چکیده

The parity vectors of two Latin squares of the same side n provide a necessary condition for the two squares to be biembeddable in an orientable surface. We investigate constraints on the parity vector of a Latin square resulting from structural properties of the square, and show how the parity vector of a direct product may be obtained from the parity vectors of the constituent factors. Parity vectors for Cayley tables of all Abelian groups, some non-Abelian groups, Steiner quasigroups and Steiner loops are determined. Finally, we give a lower bound on the number of main classes of Latin squares of side n that admit no self-embeddings.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterative Decoding for Sudoku and Latin Square Codes

This paper presents a new class of q-ary erasure-correcting codes based on Latin and Sudoku squares of order q, and an iterative decoding algorithm similar to the one used for the Low Density Parity Check code. The algorithm works by assigning binary variables to the q-ary values, and by generalizing the definition of parity check operation to represent the constraints that define the Latin and...

متن کامل

A Class of Quantum LDPC Codes Derived from Latin Squares and Combinatorial Design

In this paper we construct a class of regular Low Density Parity Check (LDPC) codes derived from Latin squares. The parity check matrices of these codes are constructed by permuting shift-orthogonal Latin squares of order n in blockrows and block-columns. I show that the constructed LDPC codes are self-orthogonal and their minimum and stopping distances are bounded. This helps us to construct a...

متن کامل

Parity Types, Cycle Structures and Autotopisms of Latin Squares

The parity type of a Latin square is defined in terms of the numbers of even and odd rows and columns. It is related to an Alon-Tarsi-like conjecture that applies to Latin squares of odd order. Parity types are used to derive upper bounds for the size of autotopy groups. A new algorithm for finding the autotopy group of a Latin square, based on the cycle decomposition of its rows, is presented,...

متن کامل

Cycle Switches in Latin Squares

Cycle switches are the simplest changes which can be used to alter latin squares, and as such have found many applications in the generation of latin squares. They also provide the simplest examples of latin interchanges or trades in latin square designs. In this paper we construct graphs in which the vertices are classes of latin squares. Edges arise from switching cycles to move from one clas...

متن کامل

Error Detecting and Correcting Code Using Orthogonal Latin Square Using Verilog HDL

Error correction codes (ECCs) are commonly used to protect memories against errors. Among ECCs, Orthogonal Latin Squares (OLS) codes have gained renewed interest for memory protection due to their modularity and the simplicity of the decoding algorithm that enables low delay implementations. An important issue is that when ECCs is used, the encoder and decoder circuits can also suffer errors. I...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Graphs and Combinatorics

دوره 26  شماره 

صفحات  -

تاریخ انتشار 2010